Parameterized approximation algorithms for packing problems

نویسنده

  • Meirav Zehavi
چکیده

In the past decade, many parameterized algorithms were developed for packing problems. Our goal is to obtain tradeoffs that improve the running times of these algorithms at the cost of computing approximate solutions. Consider a packing problem for which there is no known algorithm with approximation ratio α, and a parameter k. If the value of an optimal solution is at least k, we seek a solution of value at least αk; otherwise, we seek an arbitrary solution. Clearly, if the best known parameterized algorithm that finds a solution of value t runs in time O∗(f(t)) for some function f , we are interested in running times better than O∗(f(αk)). We present tradeoffs between running times and approximation ratios for the P2-Packing, 3-Set kPacking and 3-Dimensional k-Matching problems. Our tradeoffs are based on combinations of several known results, as well as a computation of “approximate lopsided universal sets”. 1998 ACM Subject Classification G.2.1 "Combinatorial Algorithms"; G.2.2 "Graph Algorithms"; I.1.2 "Analysis of Algorithms"

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs

We give algorithms with running time 2O( √ k log k) · nO(1) for the following problems. Given an n-vertex unit disk graph G and an integer k, decide whether G contains a path on exactly/at least k vertices, a cycle on exactly k vertices, a cycle on at least k vertices, a feedback vertex set of size at most k, and a set of k pairwise vertex-disjoint cycles. For the first three problems, no subex...

متن کامل

Parameterized Complexity and Approximation Algorithms

. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York.Page 18 of 19D. MARX THE COMPUTER JOURNAL, 2007 [113] Erlebach, T., Jansen, K. and Seidel, E. (2005) Polynomial-timeapproximation schemes for geometric intersection graphs.SIAM J. Comput., 34, 1302–1323. [114] Hochbaum, D.S. and Maass, W. (1985) Approximationschemes for cov...

متن کامل

Deterministic Parameterized Algorithms for Matching and Packing Problems

We present three deterministic parameterized algorithms for well-studied packing and matching problems, namely, Weighted q-Dimensional p-Matching ((q, p)-WDM) and Weighted qSet p-Packing ((q, p)-WSP). More specifically, we present an O(2.85043) time deterministic algorithm for (q, p)-WDM, an O(8.04143) time deterministic algorithm for the unweighted version of (3, p)-WDM, and an O((0.56201 · 2....

متن کامل

The Maximum Resource Bin Packing Problem

Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used or minimize the number or total size of accepted items. We consider off-line and on-line variants of the pr...

متن کامل

Hardness of approximation for orthogonal rectangle packing and covering problems

Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Bin Packing (without rotations), unless P = NP. We show that similar approximation hardness results hold for several 2and 3-dimensional rectangle packing and covering problems even if rotations by ninety degrees are allowed. Moreover, for some of these problems we provide explicit lower bounds on asym...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 648  شماره 

صفحات  -

تاریخ انتشار 2016